Optimum Wordlength Allocation

نویسندگان

  • George A. Constantinides
  • Peter Y. K. Cheung
  • Wayne Luk
چکیده

This paper presents an approach to the wordlength allocation and optimization problem for linear digital signal processing systems implemented in Field-Programmable Gate Arrays. The proposed technique guarantees an optimum set of wordlengths for each internal variable, allowing the user to trade-off implementation area for error at system outputs. Optimality is guaranteed through modelling as a mixed integer linear program, constructed through novel techniques for the linearization of error and area constraints. Optimum results in this field are valuable since they can be used to assess the effectiveness of heuristic wordlength optimization techniques. It is demonstrated that one such previously published heuristic reaches within 0:7% of the optimum area over a range of benchmark problems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Wordlength optimization for linear digital signal processing

This paper presents an approach to the wordlength allocation and optimization problem for linear digital signal processing systems implemented as custom parallel processing units. Two techniques are proposed, one which guarantees an optimum set of wordlengths for each internal variable, and one which is a heuristic approach. Both techniques allow the user to tradeoff implementation area for ari...

متن کامل

Optimum Wordlength Search Using Sensitivity Information

Many digital signal processing algorithms are first developed in floating point and later converted into fixed point for digital hardware implementation. During this conversion, more than 50% of the design time may be spent for complex designs, and optimum wordlengths are searched by trading off hardware complexity for arithmetic precision at system outputs. We propose a fast algorithm for sear...

متن کامل

An adaptive character wordlength algorithm for data compression

This paper presents a new and efficient data compression algorithm, namely, the adaptive character wordlength (ACW) algorithm, which can be used as complementary algorithm to statistical compression techniques. In such techniques, the characters in the source file are converted to a binary code, where the most common characters in the file have the shortest binary codes, and the least common ha...

متن کامل

An efficient algorithm for the design of lattice wave digital filters with short coefficient wordlength

This paper describes an efficient algorithm for the design of lattice wave digital filters with short coefficient wordlength. The proposed algorithm guarantees that the optimum finitewordlength solution can be found for both the fixed-point and the multiplierless coefficient representations. This is illustrated by means of several examples.

متن کامل

Design of optimum high-order finite-wordlength digital FIR filters with linear phase

A novel iterative quantization procedure for the design of finite wordlength linear phase FIR filters of high order and minimum frequency domain error is proposed: a one by one increased number of filter coefficients is quantized where the augmented frequency domain error is re-minimized in each case. This new approach achieves a smaller frequency domain error than rounding of the optimal non-q...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002